Distributed Pareto Optimization via Diffusion Strategies
نویسندگان
چکیده
منابع مشابه
Distributed Generation Planning via Strength Pareto Multiobjective Optimization Approach
Owing to the incremental demands for electrical energy, distributed generation (DG) sources are becoming more important in distribution systems. Locations and capacities of DG sources have profoundly impacted on the system losses in a distribution network. In this paper, a novel Strength Pareto Evolutionary Algorithm (SPEA) is represented for optimal location and sizing of DG on distribution sy...
متن کاملOn the Asymptotic Bias of the Diffusion-Based Distributed Pareto Optimization
We revisit the asymptotic bias analysis of the distributed Pareto optimization algorithm developed based on the diffusion strategies. We propose an alternative way to analyze the bias of this algorithm at small step-sizes and show that the bias descends to zero with a linear dependence on the largest step-size parameter when this parameter is sufficiently small. In addition, we provide an expre...
متن کاملMulti-objective Multi-view Spectral Clustering via Pareto Optimization
Traditionally, spectral clustering is limited to a single objective: finding the normalized min-cut of a single graph. However, many real-world datasets, such as scientific data (fMRI scans of different individuals), social data (different types of connections between people), web data (multi-type data), are generated from multiple heterogeneous sources. How to optimally combine knowledge from ...
متن کاملDifferential conditions for constrained nonlinear programming via Pareto optimization
We deal with differential conditions for local optimality. The conditions we derive for inequality constrained problems do not require constraint qualifications and are the broadest conditions based only on first and second order derivatives. A similar result is proved for equality constrained problems, although necessary conditions require regularity of the equality constraints.
متن کاملStochastic Pareto local search: Pareto neighbourhood exploration and perturbation strategies
Pareto local search (PLS) methods are local search algorithms for multiobjective combinatorial optimization problems based on the Pareto dominance criterion. PLS explores the Pareto neighbourhood of a set of non-dominated solutions until it reaches a local optimal Pareto front. In this paper, we discuss and analyse three different Pareto neighbourhood exploration strategies: best, first, and ne...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Journal of Selected Topics in Signal Processing
سال: 2013
ISSN: 1932-4553,1941-0484
DOI: 10.1109/jstsp.2013.2246763